Bounds on Equiangular Lines and on Related Spherical Codes
نویسنده
چکیده
An L-spherical code is a set of Euclidean unit vectors whose pairwise inner products belong to the set L. We show, for a fixed α, β > 0, that the size of any [−1,−β] ∪ {α}-spherical code is at most linear in the dimension. In particular, this bound applies to sets of lines such that every two are at a fixed angle to each another.
منابع مشابه
New Bounds for Equiangular Lines and Spherical Two-Distance Sets
The set of points in a metric space is called an s-distance set if pairwise distances between these points admit only s distinct values. Two-distance spherical sets with the set of scalar products {α,−α}, α ∈ [0, 1), are called equiangular. The problem of determining the maximal size of s-distance sets in various spaces has a long history in mathematics. We determine a new method of bounding th...
متن کاملNearly orthogonal vectors and small antipodal spherical codes
How can d+k vectors in R be arranged so that they are as close to orthogonal as possible? In particular, define θ(d, k) := minX maxx 6=y∈X |〈x, y〉| where the minimum is taken over all collections of d + k unit vectors X ⊆ R. In this paper, we focus on the case where k is fixed and d → ∞. In establishing bounds on θ(d, k), we find an intimate connection to the existence of systems of ( k+1 2 ) e...
متن کاملEquiangular Lines and Spherical Codes in Euclidean Space
A family of lines through the origin in Euclidean space is called equiangular if any pair of lines defines the same angle. The problem of estimating the maximum cardinality of such a family in R was extensively studied for the last 70 years. Motivated by a question of Lemmens and Seidel from 1973, in this paper we prove that for every fixed angle θ and sufficiently large n there are at most 2n−...
متن کاملConstructions of complex equiangular lines from mutually unbiased bases
A set of vectors of equal norm in C represents equiangular lines if the magnitudes of the Hermitian inner product of every pair of distinct vectors in the set are equal. The maximum size of such a set is d, and it is conjectured that sets of this maximum size exist in C for every d ≥ 2. We take a combinatorial approach to this conjecture, using mutually unbiased bases (MUBs) in the following 3 ...
متن کاملCodes in spherical caps
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps. Several new upper bounds on codes in caps are derived. Applications of these bounds to estimates of the kissing numbers and one-sided kissing numbers are consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 30 شماره
صفحات -
تاریخ انتشار 2016